1159A - A pile of stones - CodeForces Solution

implementation math *800

Please click on ads to support us..

Python Code: 

n=int(input())
count=0
str=input()
for i in str:
  if(i=='+'):
    count+=1
    if(count==-1):
      count=0
  if(i=='-'):
    count-=1
    if(count==-1):
      count=0
print(count)

C++ Code: 

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int operations;
    string pile;

    cin >> operations;
    cin >> pile;

    int numberStones = 0;

    for(int i = 0; i < pile.size(); i++)
    {
        if(pile[i] == '-' && numberStones)
            numberStones--;
        else if(pile[i] == '+')
            numberStones++;    
    }
    cout << numberStones;
}


Comments

Submit
0 Comments
More Questions

915A - Garden
356A - Knight Tournament
1330A - Dreamoon and Ranking Collection
1692B - All Distinct
1156C - Match Points
1675A - Food for Animals
1328C - Ternary XOR
1689A - Lex String
1708B - Difference of GCDs
863A - Quasi-palindrome
1478A - Nezzar and Colorful Balls
1581B - Diameter of Graph
404A - Valera and X
908A - New Year and Counting Cards
146A - Lucky Ticket
1594C - Make Them Equal
1676A - Lucky
1700B - Palindromic Numbers
702C - Cellular Network
1672C - Unequal Array
1706C - Qpwoeirut And The City
1697A - Parkway Walk
1505B - DMCA
478B - Random Teams
1705C - Mark and His Unfinished Essay
1401C - Mere Array
1613B - Absent Remainder
1536B - Prinzessin der Verurteilung
1699B - Almost Ternary Matrix
1545A - AquaMoon and Strange Sort